3D Delaunay Refinement of Sharp Domains without a Local Feature Size Oracle
نویسندگان
چکیده
A practical incremental refinement algorithm for computing a quality, conforming Delaunay mesh of an arbitrary 3D piecewise linear complex is given. The algorithm allows small input angles and does not require the local feature size of the input to be computed before performing the refinement. Small input angles are protected with a new type of collar which is simpler to implement and analyze than previous approaches. The algorithm has been implemented and several computational examples are given.
منابع مشابه
Delaunay Refinement Algorithms for Estimating Local Feature Size in 2D and 3D
We present Delaunay refinement algorithms for estimating local feature on the input vertices of a 2D piecewise linear complex and on the input vertices and segments of a 3D piecewise linear complex. These algorithms are designed to eliminate the need for a local feature size oracle during quality mesh generation of domains containing acute input angles. In keeping with Ruppert’s algorithm, encr...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Meshing 3D domains bounded by piecewise smooth surfaces
This report provides an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm may handle as well subdivisions of the domain forming non manifold surfaces. The boundaries and constraints are assumed to be described as a complex formed by a set of vertices, a set of curved segments and a set of surface patches. Each curve segment is assumed to be a piece of a closed smo...
متن کامل5 A . 1 Meshing 3 D Domains Bounded by Piecewise Smooth Surfaces ∗
This paper proposes an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm may handle multivolume domains defined by non connected or non manifold surfaces. The boundary and subdivision surfaces are assumed to be described by a complex formed by surface patches stitched together along curve segments. The meshing algorithm is a Delaunay refinement and it uses the not...
متن کاملRobust Three Dimensional Delaunay Refinement
The Delaunay Refinement Algorithm for quality meshing is extended to three dimensions. The algorithm accepts input with arbitrarily small angles, and outputs a Conforming Delaunay Tetrahedralization where most tetrahedra have radius-to-shortest-edge ratio smaller than some user chosen μ > 2. Those tets with poor quality are in well defined locations: their circumcenters are describably near inp...
متن کاملA Fast Algorithm for Delaunay Based Surface Reconstruction
Advanced 3D scanning technologies enable us to obtain dense and accurate surface sample point sets. From sufficiently dense sample point set, Crust algorithm, which is based on Voronoi diagram and its dual Delaunay triangulation, can reconstruct a triangle mesh that is topologically valid and convergent to the original surface. However, the algorithm is restricted in the practical application b...
متن کامل